Mathematical Programming Based on Sufficient Optimality Conditions and Higher Order Exponential Type Generalized Invexities

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical Programming Based on Sufficient Optimality Conditions and Higher Order Exponential Type Generalized Invexities

First, a class of comprehensive higher order exponential type generalized B-(b, ρ, η, ω, θ, p̃, r̃, s̃)-invexities is introduced, which encompasses most of the existing generalized invexity concepts in the literature, including the Antczak type first order B-(b, η, p̃, r̃)-invexities as well as the Zalmai type (α, β, γ, η, ρ, θ)-invexities, and then a wide range of parametrically sufficient optimali...

متن کامل

Role of exponential type random invexities for asymptotically sufficient efficiency conditions in semi-infinite multi-objective fractional programming

First a new notion of the random exponential Hanson-Antczak type [Formula: see text]-V-invexity is introduced, which generalizes most of the existing notions in the literature, second a random function [Formula: see text] of the second order is defined, and finally a class of asymptotically sufficient efficiency conditions in semi-infinite multi-objective fractional programming is established. ...

متن کامل

Higher-Order Weakly Generalized Epiderivatives and Applications to Optimality Conditions

The notions of higher-order weakly generalized contingent epiderivative and higher-order weakly generalized adjacent epiderivative for set-valued maps are proposed. By virtue of the higher-order weakly generalized contingent adjacent epiderivatives, both necessary and sufficient optimality conditions are obtained for Henig efficient solutions to a set-valued optimization problem whose constrain...

متن کامل

First order optimality conditions for generalized semi-infinite programming problems

In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...

متن کامل

Second-Order Optimality Conditions in Generalized Semi-Infinite Programming

This paper deals with generalized semi-infinite optimization problems where the (infinite) index set of inequality constraints depends on the state variables and all involved functions are twice continuously differentiable. Necessary and sufficient second order optimality conditions for such problems are derived under assumptions which imply that the corresponding optimal value function is seco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics, Optimization & Information Computing

سال: 2015

ISSN: 2310-5070,2311-004X

DOI: 10.19139/139